Pythonの関数呼び出し最適化：引数渡しメカニズムを習得する

            
def modify_list(my_list):
    my_list.append(4)
    print("Inside function:", my_list)

original_list = [1, 2, 3]
modify_list(original_list)
print("Outside function:", original_list) # Output: Outside function: [1, 2, 3, 4]

            

              
                Copy
              
            
          

            
def modify_integer(x):
    x = x + 1
    print("Inside function:", x)

original_integer = 5
modify_integer(original_integer)
print("Outside function:", original_integer) # Output: Outside function: 5

            

              
                Copy
              
            
          

            
def greet(name, greeting):
    print(f"{greeting}, {name}!")

greet("Alice", "Hello")  # Output: Hello, Alice!
greet("Hello", "Alice")  # Output: Alice, Hello! (Order matters)

            

              
                Copy
              
            
          

            
def describe_person(name, age, city):
    print(f"Name: {name}, Age: {age}, City: {city}")

describe_person(name="Bob", age=30, city="New York")
describe_person(age=25, city="London", name="Charlie") # Order doesn't matter

            

              
                Copy
              
            
          

            
def power(base, exponent=2):
    return base ** exponent

print(power(5))       # Output: 25 (5^2)
print(power(5, 3))    # Output: 125 (5^3)

            

              
                Copy
              
            
          

            
def append_to_list(value, my_list=[]):
    my_list.append(value)
    return my_list

print(append_to_list(1))  # Output: [1]
print(append_to_list(2))  # Output: [1, 2] (Unexpected!)

            

              
                Copy
              
            
          

            
def append_to_list_safe(value, my_list=None):
    if my_list is None:
        my_list = []
    my_list.append(value)
    return my_list

print(append_to_list_safe(1))  # Output: [1]
print(append_to_list_safe(2))  # Output: [2] (Correct)

            

              
                Copy
              
            
          

            
def sum_numbers(*args):
    total = 0
    for num in args:
        total += num
    return total

print(sum_numbers(1, 2, 3, 4, 5))  # Output: 15

def describe_person(**kwargs):
    for key, value in kwargs.items():
        print(f"{key}: {value}")

describe_person(name="David", age=40, city="Sydney")
# Output:
# name: David
# age: 40
# city: Sydney

            

              
                Copy
              
            
          

            
def my_function(a, b, c=0, *args, **kwargs):
    print(f"a={a}, b={b}, c={c}")
    print("*args:", args)
    print("**kwargs:", kwargs)

my_function(1, 2, 3, 4, 5, x=6, y=7)
# Output:
# a=1, b=2, c=3
# *args: (4, 5)
# **kwargs: {'x': 6, 'y': 7}

            

              
                Copy
              
            
          

            
import numpy as np

# Creating a view of a NumPy array
arr = np.array([1, 2, 3, 4, 5])
view = arr[1:4]  # View of elements from index 1 to 3
view[:] = 0       # Modifying the view modifies the original array
print(arr)       # Output: [1 0 0 0 5]

            

              
                Copy
              
            
          

            
import time

# List vs. Set for membership testing
list_data = list(range(1000000))
set_data = set(range(1000000))

start_time = time.time()
999999 in list_data
list_time = time.time() - start_time

start_time = time.time()
999999 in set_data
set_time = time.time() - start_time

print(f"List time: {list_time:.6f} seconds")
print(f"Set time: {set_time:.6f} seconds") # Set time is significantly faster

            

              
                Copy
              
            
          

            
import math

# Using math.sqrt() instead of manual implementation
def calculate_sqrt(num):
    return math.sqrt(num)

            

              
                Copy
              
            
          

            
import functools

@functools.lru_cache(maxsize=None) # lru_cache provides memoization
def fibonacci(n):
    if n <= 1:
        return n
    return fibonacci(n-1) + fibonacci(n-2)

print(fibonacci(10))  # The first call is slower, subsequent calls are much faster

            

              
                Copy
              
            
          

            
import cProfile

def my_function():
    # Your code here
    pass

cProfile.run('my_function()')

            

              
                Copy
              
            
          

            
# Using Numba to accelerate a function
from numba import jit

@jit(nopython=True)
def my_numerical_function(data):
    # Your numerical computation here
    pass

            

              
                Copy